Minimizing Message Passing in Parallel Iterative Codes
نویسنده
چکیده
A compiler transformation to minimize the number of messages in PDE parallel iterative codes is presented. For the n-dimensional high-order PDE or second-order PDE using high-order finite differences, this transformation reduces the number of messages from as large as 3 − 1 to the minimum 2n.
منابع مشابه
Short Communication A Parallel Newton–Krylov Method for Navier–Stokes Rotorcraft Codes
The application of Krylov subspace iterative methods to unsteady three-dimensional Navier–Stokes codes on massively parallel and distributed computing environments is investigated. Previously, the Euler mode of the Navier–Stokes flow solver Transonic Unsteady Rotor Navier–Stokes (TURNS) has been coupled with a Newton–Krylov scheme which uses two Conjugate-Gradient-like (CG) iterative methods. F...
متن کاملA Message-Passing Distributed Memory Parallel Algorithm for a Dual-Code Thin Layer, Parabolized Navier-Stokes Solver
In this study, the results of parallelization of a 3-D dual code (Thin Layer, Parabolized Navier-Stokes solver) for solving supersonic turbulent flow around body and wing-body combinations are presented. As a serial code, TLNS solver is very time consuming and takes a large part of memory due to the iterative and lengthy computations. Also for complicated geometries, an exceeding number of grid...
متن کاملCapacity Approaching Codes , Iterative Decoding Algorithms , and Their Applications
Implementation constraints on iterative decoders applying message-passing algorithms are investigated. Serial implementations similar to traditional microprocessor datapaths are compared against architectures with multiple processing elements that exploit the inherent parallelism in the decoding algorithm. Turbo codes and low-density parity check codes, in particular, are evaluated in terms of ...
متن کاملPartially-Parallel LDPC Decoder Achieving High-Efficiency Message-Passing Schedule
In this paper, we propose a partially-parallel LDPC decoder which achieves a high-efficiency message-passing schedule. The proposed LDPC decoder is characterized as follows: (i) The column operations follow the row operations in a pipelined architecture to ensure that the row and column operations are performed concurrently. (ii) The proposed parallel pipelined bit functional unit enables the c...
متن کاملIncremental parallelization of non-data-parallel programs using the Charon message-passing library
Message passing is among the most popular techniques for parallelizing scientific programs on distributed-memory architectures. The reasons for its success are wide availability (MPI [8]), efficiency, and full tuning control provided to the programmer. A major drawback, however, is that incremental parallelization, as offered by compiler directives, is not generally possible, because all data s...
متن کامل